Ela Regions Containing Eigenvalues of a Matrix
نویسندگان
چکیده
In this paper, regions containing eigenvalues of a matrix are obtained in terms of partial absolute deleted row sums and column sums. Furthermore, some sufficient and necessary conditions for H-matrices are derived. Finally, an upper bound for the Perron root of nonnegative matrices is presented. The comparison of the new upper bound with the known ones is supplemented with some examples.
منابع مشابه
Localization of Eigenvalues in Small Specified Regions of Complex Plane by State Feedback Matrix
This paper is concerned with the problem of designing discrete-time control systems with closed-loop eigenvalues in a prescribed region of stability. First, we obtain a state feedback matrix which assigns all the eigenvalues to zero, and then by elementary similarity operations we find a state feedback which assigns the eigenvalues inside a circle with center and radius. This new algorithm ca...
متن کاملEla a Note on a Distance Bound Using Eigenvalues of the Normalized Laplacian Matrix∗
Let G be a connected graph, and let X and Y be subsets of its vertex set. A previously published bound is considered that relates the distance between X and Y to the eigenvalues of the normalized Laplacian matrix for G, the volumes of X and Y , and the volumes of their complements. A counterexample is given to the bound, and then a corrected version of the bound is provided.
متن کاملEla Short Proofs of Theorems of Mirsky and Horn on Diagonals and Eigenvalues of Matrices∗
A theorem of Mirsky provides necessary and sufficient conditions for the existence of an N-square complex matrix with prescribed diagonal entries and prescribed eigenvalues. A simple inductive proof of this theorem is given.
متن کاملReduced-Reference Image Quality Assessment based on saliency region extraction
In this paper, a novel saliency theory based RR-IQA metric is introduced. As the human visual system is sensitive to the salient region, evaluating the image quality based on the salient region could increase the accuracy of the algorithm. In order to extract the salient regions, we use blob decomposition (BD) tool as a texture component descriptor. A new method for blob decomposition is propos...
متن کاملEla on the Main Signless Laplacian Eigenvalues of a Graph
A signless Laplacian eigenvalue of a graph G is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, some necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues are given. And the trees and unicyclic graphs with exactly two main signless L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006